On Coherence Properties in Team Rewriting Models of Concurrency
نویسنده
چکیده
This paper introduces a generic and uniform approach to integrate different design languages for distributed systems in verification tools. It is based on Meseguer’s Rewriting Logic, hence transitions between the states of the respective system are modeled as (conditional) term rewriting steps modulo an equational theory. We argue that, for reasons of efficiency, it is intractable to admit arbitrary equations, and propose to employ rewriting modulo associativity and commutativity instead, using oriented versions of the equations. Furthermore the question is raised under which conditions this implementational restriction is complete. To this aim we define a coherence property which guarantees that every transition which is possible in the (fully equational) semantics can also be computed using the oriented equations, and we show that this property can be verified by testing the joinability of finitely many conditional critical pairs between transition rules and oriented equations.
منابع مشابه
Using Rewriting Logic to implement FULL
A common problem of automated tools for Formal Methods is their difficulty in dealing with infinite systems. Such systems may arise through the use of infinite data types. For example, in the LOTOS [6] formal description technique the simple process g?x : Nat; exit results in an infinite choice, one for each member of Nat. Rewriting logic [7] is a possible approach to dealing with such systems....
متن کاملAn Optimal Approach to Local and Global Text Coherence Evaluation Combining Entity-based, Graph-based and Entropy-based Approaches
Text coherence evaluation becomes a vital and lovely task in Natural Language Processing subfields, such as text summarization, question answering, text generation and machine translation. Existing methods like entity-based and graph-based models are engaging with nouns and noun phrases change role in sequential sentences within short part of a text. They even have limitations in global coheren...
متن کاملRewriting Logic as a Semantic Framework for Concurrency: a Progress Report
This paper surveys the work of many researchers on rewriting logic since it was rst introduced in 1990. The main emphasis is on the use of rewriting logic as a semantic framework for concurrency. The goal in this regard is to express as faithfully as possible a very wide range of concurrency models, each on its own terms, avoiding any encodings or translations. Bringing very diierent models und...
متن کاملOn the Qualitative Analysis of Conformon P Systems
We study computational properties of conformon P-systems, an extension of P-systems in which symbol objects are labelled by their current amount of energy. We focus here our attention to decision problems like reachability and coverability of a configuration and give positive and negative results for the full model and for some of its fragments. Furthermore, we investigate the relation between ...
متن کاملRelating Two Categorical Modelsof Term Rewriting ?
In the last years there has been a growing interest towards categorical models for term rewriting systems (trs's). In our opinion, very interesting are those associating to each trs's a cat-enriched structure: a category whose hom-sets are categories. Interpreting rewriting steps as morphisms in hom-categories, these models provide rewriting systems with a concurrent semantics in a clean algebr...
متن کامل